Ternary Functions Design Using Memristive Threshold Logic
نویسندگان
چکیده
منابع مشابه
Memristive Threshold Logic Face Recognition
This paper presents a face recognition method implemented using reconfigurable network of memristive threshold logic cells that can be practically realised in a secondary plane to the pixel arrays. Among the most distinguishing features of the presented system are a) an early detection and storage of only the relevant information directly from the sensors, b) a parallel, scalable information st...
متن کاملMulti-threshold Threshold Logic Circuit Design Using Resonant Tunneling Devices
This Letter presents a novel and extremely compact circuit topology able to implement a generalized threshold logic function with two thresholds. The circuit consists of resonant tunnelling diodes (RTDs) and heterostructure field effect transistors (HFETs). Introduction: Resonant tunneling devices are nowadays considered the most mature type of quantum-effect devices. They are already operating...
متن کاملDesign and Application of Pipelined Dynamic CMOS Ternary Logic and Simple Ternary Differential Logic
New dynamic CMOS ternary logic circuits, which can be used to form a pipelined system with the nonoverlapped two-phase clocks, are p r o p e d and investigated. AU the proposed new dynamic ternary gates do not have dc power dissipations and have full voltage swings. For complex ternary logic, a new circuit structure called the simple ternary differential logic (STDL) is also proposed and analyz...
متن کاملSPICE model of memristive devices with threshold
Although memristive devices with threshold voltages are the norm rather than the exception in experimentally realizable systems, their SPICE programming is not yet common. Here, we show how to implement such systems in the SPICE environment. Specifically, we present SPICE models of a popular voltage-controlled memristive system specified by five different parameters for PSPICE and NGSPICE circu...
متن کاملUsing Ternary Trees in Logic Synthesis
We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms – a ternary tree. The minimization procedure is based on a fast application of basic Boolean operations upon the ternary tree, combined with algorithms used in the Espresso minimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2909500